Lifted Inequalities for a Softdrink Lotscheduling Model
نویسندگان
چکیده
In this paper, we propose the inclusion of a set of valid inequalities derived using a lifting procedure into a lot scheduling model applied to the soft-drink production. The set of valid inequalities is derived from constraints associated with the scheduling decisions. A computational study conducted to evaluate the quality of the proposed reformulation and how the lifted inequalities relate to the cutting planes included in a commercial solver is described. The results, using data from the literature, show that under certain conditions the proposed inequality is useful to improve the solution process of the lot scheduling model.
منابع مشابه
The Complexity of Lifted Inequalities for the Knapsack Problem
Hartvigsen, D. and E. Zemel, The complexity of lifted inequalities for the knapsack problem, Discrete Applied Mathematics 39 (1992) 11. 123. It is well known that one can obtain facets and valid inequalities for the knapsack polytope by lifting simple inequalities associated with minimal covers. We study the complexity of lifting. We show that recognizing integral lifted facets or valid inequal...
متن کاملA Polyhedral Study of the Cardinality Constrained Knapsack Problem
A cardinality constrained knapsack problem is a continuous knapsack problem in which no more than a specified number of nonnegative variables are allowed to be positive. This structure occurs, for example, in areas as finance, location, and scheduling. Traditionally, cardinality constraints are modeled by introducing auxiliary 0-1 variables and additional constraints that relate the continuous ...
متن کاملDeveloping a Novel Temperature Model in Gas Lifted Wells to Enhance the Gas Lift Design
In the continuous gas lift operation, compressed gas is injected into the lower section of tubing through annulus. The produced liquid flow rate is a function of gas injection rate and injection depth. All the equations to determine depth of injection assumes constant density for gas based on an average temperature of surface and bottomhole that decreases the accuracy of gas lift design. Also g...
متن کاملOn Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
In this paper we study valid inequalities for a set that involves a continuous vector variable x ∈ [0, 1], its associated quadratic form xx , and binary indicators on whether or not x > 0. This structure appears when deriving strong relaxations for mixed integer quadratic programs (MIQPs). Valid inequalities for this set can be obtained by lifting inequalities for a related set without binary v...
متن کاملLifted Cover Inequalities for Integer Programs Computation
We investigate the algorithmic and implementation issues related to the e ective and e cient use of lifted cover inequalities and lifted GUB cover inequalities in a branch and cut algorithm for integer programming We have tried various strategies on several test problems and we identify the best ones for use in practice
متن کامل